Non-orientable quasi-trees for the Bollobás–Riordan polynomial
نویسندگان
چکیده
منابع مشابه
Non-orientable quasi-trees for the Bollobás-Riordan polynomial
We extend the quasi-tree expansion of A. Champanerkar, I. Kofman, and N. Stoltzfus to not necessarily orientable ribbon graphs. We study the duality properties of the Bollobás-Riordan polynomial in terms of this expansion. As a corollary, we get a “connected state” expansion of the Kauffman bracket of virtual link diagrams. Our proofs use extensively the partial duality of S. Chmutov.
متن کاملQuasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees
We study the class of non-commutative Unambiguous circuits or Unique-Parse-Tree (UPT) circuits, and a related model of Few-Parse-Trees (FewPT) circuits (which were recently introduced by Lagarde, Malod and Perifel [LMP16] and Lagarde, Limaye and Srinivasan [LLS17]) and give the following constructions: • An explicit hitting set of quasipolynomial size for UPT circuits, • An explicit hitting set...
متن کاملOrientable and non-orientable director fields for liquid crystals
Uniaxial nematic liquid crystals are often modelled using the Oseen-Frank theory, in which the mean orientation of the rodlike molecules is described through a unit vector field n. This theory has the apparent drawback that it does not respect the head-to-tail symmetry in which n should be equivalent to −n; that is, instead of n taking values in the unit sphere S, it should take values in the s...
متن کاملCoding Non-orientable Laminations
Surface laminations are classic closed sets of disjoint curves in surfaces. We give here a full description of how to obtain codings of such laminations when they are non-orientable by using lamination languages, i.e. specific linear complexity languages of two-way infinite words. We also compare lamination languages with symbolic laminations, i.e. the coding counterparts of algebraic laminations.
متن کاملOrientable and non-orientable maps with given automorphism groups
We prove that for every finite group G there exist orient able as well as non-orientable maps with automorphism group isomorphic to G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2011
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2010.12.005